منابع مشابه
Sets of double and triple weights of trees
Abstract. Let T be a weighted tree with n leaves numbered by the set {1, ..., n}. Let Di,j be the distance between the leaves i and j. Let Di,j,k = 1 2 (Di,j +Dj,k +Di,k). We will call such numbers “triple weights” of the tree. In this paper, we find necessary and sufficient conditions for a set of real numbers indexed by 3-subsets of an n-set to be the set of the triple weights of a tree with ...
متن کاملComparison of triple and double phototherapy in neonatal hyperbilirubinemia
Introduction: Icterus is the most common medical problem in neonates. Phototherapy is standard treatment of neonatal hyperbilirubinemia. This study aims to compare efficacy and length of hospitalization of double and triple phototherapy in term newborns with indirect hyperbilirubinemia. Methods: In a randomized clinical trial 40 healthy term newborns (gestational age>37 weeks) with weight≥250...
متن کاملMinimal Double Dominating Sets in Trees
We provide an algorithm for listing all minimal double dominating sets of a tree of order n in time O(1.3248). This implies that every tree has at most 1.3248 minimal double dominating sets. We also show that this bound is tight.
متن کامل"And"- and "Or"-operations for "double", "triple", etc. fuzzy sets
In the traditional fuzzy logic, the expert’s degree of confidence d(A&B) in a complex statement A&B (or A∨B) is uniquely determined by his/her degrees of confidence d(A) and d(B) in the statements A and B, as f&(d(A), d(B)) for an appropriate “and”-operation (t-norm). In practice, for the same degrees d(A) and d(B), we may have different degrees d(A&B) depending on the relation between A and B....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2011
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-011-0118-1